Survey of the Equational Logic
نویسنده
چکیده
In 1975 I started a small project to explore the consequences of implementing equational programs with no semantic compromises. Latest results include a compiler that executes exactly the logical consequences of an equa-tional program, with run-time speed comparable to compiled Franz LISP. This paper surveys the development of the project, through theoretical foundations , algorithm development, design and implementation, application, and directions for the future.
منابع مشابه
Unity in nominal equational reasoning: The algebra of equality on nominal sets
There are currently no fewer than four dedicated logics for equality reasoning over nominal sets: nominal algebra, nominal equational logic, nominal equational logic with equality only, and permissive-nominal algebra. In this survey and research paper we present these logics side-by-side in a common notation, survey their similarities and differences, discuss their proofand model-theories, and ...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملImpossibility Results in the Equational Logic of Processes
This talk offers a survey of negative results on the existence of finite equational axiomatizations for bisimulation equivalence over fragments of algebraic process calculi.
متن کاملEquational Logic and Theories of Action
This is a survey on reasoning about situations, actions, and causality within equational logic. Its main feature is the representation of situations as multisets of resources. Such resources are consumed whenever the conditions of an action are satissed and are produced whenever the action is applied. It is demonstrated that the well{known frame and ramiication problems can be elegantly solved ...
متن کاملCategory-based Semantics for Equational and Constraint Logic Programming
This thesis proposes a general framework for equational logic programming, called catf:gory based equational logic by placing the general principles underlying the design of the pro gramming language Eqlog and formulated by Goguen and Meseguer into an abstract form. This framework generalises equational deduction to an arbitrary category satisfy ing certain natural conditions; completeness i...
متن کاملNarrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both cases, narrowing supports equational reasoning and assumes confluent equations. The main goal of this work is to show that narrowing can be greatly generalized, so as to support a much wider range of applications, when ...
متن کامل